Spanning Tree Calculations on D-Wave 2 Machines

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On spanning tree congestion

We prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge-cut defined in G by the vertex sets of the two components of T − e contains at most n 32 many edges which solves a problem posed by Ostrovskii (Minimal congestion trees, Discrete Math. 285 (2004), 219-226.)

متن کامل

The 2-hop spanning tree problem

Given a graph G with a speciied root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

متن کامل

Graphs admitting d-realizers: spanning-tree-decompositions and box-representations

A d-realizer is a collection R = {π1, . . . , πd} of d permutations of a set V representing an antichain in R. We use R to define a graph GR on the suspended set V + = V ∪ {s1, . . . , sd}. It turns out that GR has dn+ ( d 2 ) edges (n = |V |), among them the edges of the outer clique on {s1, . . . , sd}. The inner edges of GR can be partitioned into d trees such that Ti spans V + si. In the ca...

متن کامل

The use of minimal spanning tree to characterize the 2 D cluster galaxy distribution ?

We use the Minimal Spanning Tree to characterize the aggregation level of given sets of points. We test 3 distances based on the histogram of the MST edges to discriminate between the distributions. We calibrate the method by using artificial sets following Poisson, King or NFW distributions. The distance using the mean, the dispersion and the skewness of the histogram of MST edges provides the...

متن کامل

The Generalized Wave Model Representation of Singular 2-D Systems

    M. and M.   Abstract: Existence and uniqueness of solution for singular 2-D systems depends on regularity condition. Simple regularity implies regularity and under this assumption, the generalized wave model (GWM) is introduced to cast singular 2-D system of equations as a family of non-singular 1-D models with variable structure.These index dependent models, along with a set of boundary co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2016

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/681/1/012005